Solving Complex Quadratic Systems With Full-Rank Random Matrices
نویسندگان
چکیده
منابع مشابه
Solving Most Systems of Random Quadratic Equations
This paper deals with finding an n-dimensional solution x to a system of quadratic equations yi = |〈ai,x〉|, 1 ≤ i ≤ m, which in general is known to be NP-hard. We put forth a novel procedure, that starts with a weighted maximal correlation initialization obtainable with a few power iterations, followed by successive refinements based on iteratively reweighted gradient-type iterations. The novel...
متن کاملSolving Almost all Systems of Random Quadratic Equations
This paper deals with finding an n-dimensional solution x to a system of quadratic equations of the form yi = |〈ai,x〉| for 1 ≤ i ≤ m, which is also known as phase retrieval and is NP-hard in general. We put forth a novel procedure for minimizing the amplitude-based least-squares empirical loss, that starts with a weighted maximal correlation initialization obtainable with a few power or Lanczos...
متن کاملSolving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
We consider the fundamental problem of solving quadratic systems of equations in n variables, where yi = |〈ai,x〉|, i = 1, . . . ,m and x ∈ R is unknown. We propose a novel method, which starting with an initial guess computed by means of a spectral method, proceeds by minimizing a nonconvex functional as in the Wirtinger flow approach [11]. There are several key distinguishing features, most no...
متن کاملOn the Rank of Random Sparse Matrices
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This allows us to obtain an exact estimate for the co-rank.
متن کاملRank Minimization Approach for Solving Bmi Problems with Random Search
This paper presents the rank minimization approach to solve general bilinear matrix inequality (BMI) problems. Due to the NP-hardness of BMI problems, no proposed algorithm that globally solves general BMI problems is a polynomial-time algorithm. We present a local search algorithm based on the semidefinite programming (SDP) relaxation approach to indefinite quadratic programming, which is anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2020
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2020.3011016